Implementing an efficient fptas for the 0-1 multi-objective knapsack problem

In the present work we are interested in the practical behavior of a new fptas to solve the approximation version of the 0-1 multi-objective knapsack problem. The proposed methodology makes use of very general techniques (such as dominance relations in dynamic programming) and thus may be applicable in the implementation of fptas for other problems as well. Extensive numerical experiments on various types of instances in the bi and triobjective cases establish that our method performs very well both in terms of CPU time and size of solved instances. We point out some reasons for the good practical performance of our algorithm. A comparison with an exact method and the fptas proposed in Erlebach et al. (2002) is also performed.